Very High Accuracy Chebyshev Expansions for the Basic Trigonometric Functions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Section 8: Basic Trigonometric Functions

Our goal in this section is to define and develop the six basic trigonometric functions. We start with two of the more important transcendental functions, namely the sine function and the cosine function. These are universally denoted by y = sinx and y = cos x respectively. In order to define sinx and cosx, we first need to agree on how we are going to measure angles. An angle, θ, consists of t...

متن کامل

Quasi-orthogonal expansions for functions in BMO

For {φ_n(x)}, x ε [0,1] an orthonormalsystem of uniformly bounded functions, ||φ_n||_{∞}≤ M

متن کامل

Rigorous uniform approximation of D-finite functions using Chebyshev expansions

A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of such methods in the context of rigorous computing (where we need guarantees on the accuracy of the result), and from the complexity point of view. It is well-kn...

متن کامل

Optimizing Spectral Sums using Randomized Chebyshev Expansions

The trace of matrix functions, often called spectral sums, e.g., rank, log-determinant and nuclear norm, appear in many machine learning tasks. However, optimizing or computing such (parameterized) spectral sums typically involves the matrix decomposition at the cost cubic in the matrix dimension, which is expensive for large-scale applications. Several recent works were proposed to approximate...

متن کامل

Multidimensional Fast Gauss Transforms by Chebyshev Expansions

A new version of the fast Gauss transform (FGT) is introduced which is based on a truncated Chebyshev series expansion of the Gaussian. Unlike the traditional fast algorithms, the scheme does not subdivide sources and evaluation points into multiple clusters. Instead, the whole problem geometry is treated as a single cluster. Estimates for the error as a function of the dimension d and the expa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1980

ISSN: 0025-5718

DOI: 10.2307/2006232